Sharp bounds on the zeroth-order general Randić indices of conjugated bicyclic graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on the zeroth-order general randić index of cacti and polyomino chains

The present note is devoted to establish some extremal results for the zeroth-order general Randi'{c} index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.

متن کامل

Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number

For a (molecular) graph, the first Zagreb index M1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M2 is equal to the sum of products of degrees of pairs of adjacent vertices. In this paper, we investigate Zagreb indices of bicyclic graphs with a given matching number. Sharp upper bounds for the first and second Zagreb indices of bicyclic graphs in terms of the...

متن کامل

a note on the zeroth-order general randić index of cacti and polyomino chains

the present note is devoted to establish some extremal results for the zeroth-order general randi'{c} index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.

متن کامل

Sharp lower bounds for the Zagreb indices of unicyclic graphs

The first Zagreb index M1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices of the respective graph. In this paper we present the lower bound on M1 and M2 among all unicyclic graphs of given order, maximum degree, and cycle length, and characterize graphs for which th...

متن کامل

Hosoya Indices of Bicyclic Graphs

Given a molecular graph G, the Hosoya index Z(G) of G is defined as the total number of the matchings of the graph. Let Bn denote the set of bicyclic graphs on n vertices. In this paper, the minimal, the second-, the third-, the fourth-, and the fifth-minimal Hosoya indices of bicyclic graphs in the set Bn are characterized.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical and Computer Modelling

سال: 2011

ISSN: 0895-7177

DOI: 10.1016/j.mcm.2011.01.030